منابع مشابه
The Mathematics of Endre Szemerédi
Endre Szemerédi is famous for his work in combinatorics and theoretical computer science. He has published a very large number of papers, often involving extraordinarily intricate arguments, so it will not be possible in an article such as this to do justice to either the breadth or the depth of his work. Instead, therefore, I shall describe a representative sample of his best known theorems, a...
متن کاملThe Work of Endre Szemerédi
Endre Szemerédi is famous for his work in combinatorics and theoretical computer science. He has published a very large number of papers, often involving extraordinarily intricate arguments, so it will not be possible in an article such as this to do justice to either the breadth or the depth of his work. Instead, therefore, I shall describe a representative sample of his best known theorems, a...
متن کاملKan Extensions of Institutions
Institutions were introduced by Goguen and Burstall 8, 9, 10, 11] to formally capture the notion of logical system. Interpreting institutions as functors, and morphisms and representations of institutions as natural transformations, we give elegant proofs for the completeness of the categories of institutions with morphisms and representations, respectively, show that the duality between morphi...
متن کاملComputing left Kan extensions
We describe a new extension of the Todd–Coxeter algorithm adapted to computing left Kan extensions. The algorithm is a much simplified version of that introduced by Carmody and Walters (Category Theory, Proceedings of the International Conference Held in Como, Italy, 22–28 July 1990. Springer) in 1991. The simplification allows us to give a straightforward proof of its correctness and terminati...
متن کاملLeft Kan Extensions Over !-Cat
An existing procedure to compute left Kan extensions over the ground category Set also computes left Kan extensions over the ground categories Cat, 2-Cat, n-Cat for any n and indeed !-Cat. Therefore extension data struc-tured in this manner already can make use of the left Kan extension notion of a best possible approximation. Examples include systems of labeled transition systems and certain h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tidsskrift for Den norske legeforening
سال: 2017
ISSN: 0029-2001
DOI: 10.4045/tidsskr.17.0530